Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction

A simple scheme for communication over MIMO broadcast channels is introduced which adopts the lattice reduction technique to improve the naive channel inversion method. Lattice basis reduction helps us to reduce the average transmitted energy by modifying the region which includes the constellation points. Simulation results show that the proposed scheme performs well, and as compared to the more complex methods (such as the perturbation method) has a negligible loss. Moreover, the proposed method is extended to the case of different rates for different users. The asymptotic behavior of the symbol error rate of the proposed method and the perturbation technique, and also the outage probability for the case of fixed-rate users is analyzed. It is shown that the proposed method, based on LLL lattice reduction, achieves the optimum asymptotic slope of symbol-error-rate (called the precoding diversity). Also, the outage probability for the case of fixed sum-rate is analyzed.Comment: Submitted to IEEE Trans. on Info. Theory (Jan. 15, 2006), Revised (Jun. 12, 2007

Fairness in Multiuser Systems with Polymatroid Capacity Region

For a wide class of multi-user systems, a subset of capacity region which includes the corner points and the sum-capacity facet has a special structure known as polymatroid. Multiaccess channels with fixed input distributions and multiple-antenna broadcast channels are examples of such systems. Any interior point of the sum-capacity facet can be achieved by time-sharing among corner points or by an alternative method known as rate-splitting. The main purpose of this paper is to find a point on the sum-capacity facet which satisfies a notion of fairness among active users. This problem is addressed in two cases: (i) where the complexity of achieving interior points is not feasible, and (ii) where the complexity of achieving interior points is feasible. For the first case, the corner point for which the minimum rate of the active users is maximized (max-min corner point) is desired for signaling. A simple greedy algorithm is introduced to find the optimum max-min corner point. For the second case, the polymatroid properties are exploited to locate a rate-vector on the sum-capacity facet which is optimally fair in the sense that the minimum rate among all users is maximized (max-min rate). In the case that the rate of some users can not increase further (attain the max-min value), the algorithm recursively maximizes the minimum rate among the rest of the users. It is shown that the problems of deriving the time-sharing coefficients or rate-spitting scheme can be solved by decomposing the problem to some lower-dimensional subproblems. In addition, a fast algorithm to compute the time-sharing coefficients to attain a general point on the sum-capacity facet is proposed.Comment: Submitted To IEEE Transactions on Information Theory, June 200

Integration over Tropical Plane Curves and Ultradiscretization

In this article we study holomorphic integrals on tropical plane curves in view of ultradiscretization. We prove that the lattice integrals over tropical curves can be obtained as a certain limit of complex integrals over Riemannian surfaces.Comment: 32pages, 12figure

Applications of Lattice Codes in Communication Systems

In the last decade, there has been an explosive growth in different applications of wireless technology, due to users' increasing expectations for multi-media services. With the current trend, the present systems will not be able to handle the required data traffic. Lattice codes have attracted considerable attention in recent years, because they provide high data rate constellations. In this thesis, the applications of implementing lattice codes in different communication systems are investigated. The thesis is divided into two major parts. Focus of the first part is on constellation shaping and the problem of lattice labeling. The second part is devoted to the lattice decoding problem. In constellation shaping technique, conventional constellations are replaced by lattice codes that satisfy some geometrical properties. However, a simple algorithm, called lattice labeling, is required to map the input data to the lattice code points. In the first part of this thesis, the application of lattice codes for constellation shaping in Orthogonal Frequency Division Multiplexing (OFDM) and Multi-Input Multi-Output (MIMO) broadcast systems are considered. In an OFDM system a lattice code with low Peak to Average Power Ratio (PAPR) is desired. Here, a new lattice code with considerable PAPR reduction for OFDM systems is proposed. Due to the recursive structure of this lattice code, a simple lattice labeling method based on Smith normal decomposition of an integer matrix is obtained. A selective mapping method in conjunction with the proposed lattice code is also presented to further reduce the PAPR. MIMO broadcast systems are also considered in the thesis. In a multiple antenna broadcast system, the lattice labeling algorithm should be such that different users can decode their data independently. Moreover, the implemented lattice code should result in a low average transmit energy. Here, a selective mapping technique provides such a lattice code. Lattice decoding is the focus of the second part of the thesis, which concerns the operation of finding the closest point of the lattice code to any point in N-dimensional real space. In digital communication applications, this problem is known as the integer least-square problem, which can be seen in many areas, e.g. the detection of symbols transmitted over the multiple antenna wireless channel, the multiuser detection problem in Code Division Multiple Access (CDMA) systems, and the simultaneous detection of multiple users in a Digital Subscriber Line (DSL) system affected by crosstalk. Here, an efficient lattice decoding algorithm based on using Semi-Definite Programming (SDP) is introduced. The proposed algorithm is capable of handling any form of lattice constellation for an arbitrary labeling of points. In the proposed methods, the distance minimization problem is expressed in terms of a binary quadratic minimization problem, which is solved by introducing several matrix and vector lifting SDP relaxation models. The new SDP models provide a wealth of trade-off between the complexity and the performance of the decoding problem

Geoeconomic variations in epidemiology, ventilation management, and outcomes in invasively ventilated intensive care unit patients without acute respiratory distress syndrome: a pooled analysis of four observational studies

Background: Geoeconomic variations in epidemiology, the practice of ventilation, and outcome in invasively ventilated intensive care unit (ICU) patients without acute respiratory distress syndrome (ARDS) remain unexplored. In this analysis we aim to address these gaps using individual patient data of four large observational studies. Methods: In this pooled analysis we harmonised individual patient data from the ERICC, LUNG SAFE, PRoVENT, and PRoVENT-iMiC prospective observational studies, which were conducted from June, 2011, to December, 2018, in 534 ICUs in 54 countries. We used the 2016 World Bank classification to define two geoeconomic regions: middle-income countries (MICs) and high-income countries (HICs). ARDS was defined according to the Berlin criteria. Descriptive statistics were used to compare patients in MICs versus HICs. The primary outcome was the use of low tidal volume ventilation (LTVV) for the first 3 days of mechanical ventilation. Secondary outcomes were key ventilation parameters (tidal volume size, positive end-expiratory pressure, fraction of inspired oxygen, peak pressure, plateau pressure, driving pressure, and respiratory rate), patient characteristics, the risk for and actual development of acute respiratory distress syndrome after the first day of ventilation, duration of ventilation, ICU length of stay, and ICU mortality. Findings: Of the 7608 patients included in the original studies, this analysis included 3852 patients without ARDS, of whom 2345 were from MICs and 1507 were from HICs. Patients in MICs were younger, shorter and with a slightly lower body-mass index, more often had diabetes and active cancer, but less often chronic obstructive pulmonary disease and heart failure than patients from HICs. Sequential organ failure assessment scores were similar in MICs and HICs. Use of LTVV in MICs and HICs was comparable (42\ub74% vs 44\ub72%; absolute difference \u20131\ub769 [\u20139\ub758 to 6\ub711] p=0\ub767; data available in 3174 [82%] of 3852 patients). The median applied positive end expiratory pressure was lower in MICs than in HICs (5 [IQR 5\u20138] vs 6 [5\u20138] cm H2O; p=0\ub70011). ICU mortality was higher in MICs than in HICs (30\ub75% vs 19\ub79%; p=0\ub70004; adjusted effect 16\ub741% [95% CI 9\ub752\u201323\ub752]; p<0\ub70001) and was inversely associated with gross domestic product (adjusted odds ratio for a US$10 000 increase per capita 0\ub780 [95% CI 0\ub775\u20130\ub786]; p<0\ub70001). Interpretation: Despite similar disease severity and ventilation management, ICU mortality in patients without ARDS is higher in MICs than in HICs, with a strong association with country-level economic status. Funding: No funding

Matrix-Lifting SDP for Decoding in Multiple Antenna Systems

Recently, a lot of quasi-maximum likelihood decoding methods have been introduced to solve the decoding problem in multiple antenna systems. The general method proposed in [1] has a near optimal performance for M-ary QAM or PSK constellation. The advantage of this algorithm is that it can be implemented for any constellation with an arbitrary binary labeling, say Gray labeling. However, it is more complex compared to some other methods that specialized their algorithm for a limited scenario (also with degraded performance). In this paper, we introduce a new general algorithm based on matrix-lifting Semi-Definite Programming (SDP). The new relaxation introduces a small degradation in the performance; however, the reduction in the complexity is prohibitively large. The number of variables is decreased from O(N 2 K 2) to O((N + K) 2). Moreover, it can be implemented for any constellation and labeling method

PAPR Reduction in OFDM Systems Using Constellation Shaping

This work considers the problem of Peak to Average Power Ratio (PAPR) reduction in an Orthogonal Frequency Division Multiplexing system. We design a cubic constellation, called Hadamard constellation, whose boundary is along the bases defined by the Hadamard matrix in the transform domain and then we further reduce the PAPR by applying the Selective Mapping technique. The encoding algorithm is based on a decomposition known as Smith Normal Form and has a minimal complexity. The proposed scheme significantly outperforms the other PAPR reduction techniques reported in the literature (offering about lower PAPR compared to some recent techniques without any additional cost in terms of energy and/or spectral efficiency) and has a small computational complexity

Integer-Based Constellation Shaping Method for PAPR Reduction in OFDM Systems

In this work, the problem of reducing the Peak to Average Power Ratio (PAPR) in an Orthogonal Frequency Division Multiplexing (OFDM) system is considered. We design a cubic constellation, called the Hadamard constellation, whose boundary is along the bases defined by the Hadamard matrix in the transform domain. Then, we further reduce the PAPR by applying the Selective Mapping technique. The encoding method, following the method introduced in [1], is derived from a decomposition known as the Smith Normal Form (SNF). This new technique offers a PAPR that is significantly lower than that of the best known techniques without any loss in terms of energy and/or spectral efficiency and without any side information being transmitted. Moreover, it has a low computational complexity